Numerically Stable Algorithms for Inversion of Block Tridiagonal and Banded Matrices
نویسندگان
چکیده
We provide a new representation for the inverse of block tridiagonal and banded matrices. The new representation is shown to be numerically stable over a variety of block tridiagonal matrices, in addition of being more computationally efficient than the previously proposed techniques. We provide two algorithms for commonly encountered problems that illustrate the usefulness of the results.
منابع مشابه
Inversion of block matrices with block banded inverses: application to Kalman-Bucy filtering
We investigate the properties of block matrices with block banded inverses to derive efficient matrix inversion algorithms for such matrices. In particular, we derive the following: (1) a recursive algorithm to invert a full matrix whose inverse is structured as a block tridiagonal matrix; (2) a recursive algorithm to compute the inverse of a structured block tridiagonal matrix. These algorithm...
متن کاملCharacterizing the inverses of block tridiagonal, block Toeplitz matrices
We consider the inversion of block tridiagonal, block Toeplitz matrices and comment on the behaviour of these inverses as one moves away from the diagonal. Using matrix Möbius transformations, we first present an O(1) representation (with respect to the number of block rows and block columns) for the inverse matrix and subsequently use this representation to characterize the inverse matrix. The...
متن کاملBlock Matrices With -Block-banded Inverse: Inversion Algorithms
Block-banded matrices generalize banded matrices. We study the properties of positive definite full matrices whose inverses are -block-banded. We show that, for such matrices, the blocks in the -block band of completely determine ; namely, all blocks of outside its -block band are computed from the blocks in the -block band of . We derive fast inversion algorithms for and its inverse that, when...
متن کاملFast and Stable Algorithms for Banded Plus Semiseparable Systems of Linear Equations
We present fast and numerically stable algorithms for the solution of linear systems of equations, where the coefficient matrix can be written in the form of a banded plus semiseparable matrix. Such matrices include banded matrices, banded bordered matrices, semiseparable matrices, and block-diagonal plus semiseparable matrices as special cases. Our algorithms are based on novel matrix factoriz...
متن کاملIdentities and exponential bounds for transfer matrices
Abstract. This paper is about analytic properties of single transfer matrices originating from general block-tridiagonal or banded matrices. Such matrices occur in various applications in physics and numerical analysis. The eigenvalues of the transfer matrix describe localization of eigenstates and are linked to the spectrum of the block tridiagonal matrix by a determinantal identity. If the bl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013